A simple differentiable programming language
نویسندگان
چکیده
منابع مشابه
A Language for Differentiable Functions
We introduce a typed lambda calculus in which real numbers, real functions, and in particular continuously differentiable and more generally Lipschitz functions can be defined. Given an expression representing a real-valued function of a real variable in this calculus, we are able to evaluate the expression on an argument but also evaluate the generalised derivative, i.e., the L-derivative, equ...
متن کاملDifferentiable Genetic Programming
We introduce the use of high order automatic differentiation, implemented via the algebra of truncated Taylor polynomials, in genetic programming. Using the Cartesian Genetic Programming encoding we obtain a high-order Taylor representation of the program output that is then used to back-propagate errors during learning. The resulting machine learning framework is called differentiable Cartesia...
متن کاملProgramming with a Differentiable Forth Interpreter
There are families of neural networks that can learn to compute any function, provided sufficient training data. However, given that in practice training data is scarce for all but a small set of problems, a core question is how to incorporate prior knowledge into a model. Here we consider the case of prior procedural knowledge, such as knowing the overall recursive structure of a sequence tran...
متن کاملA differentiable approach to inductive logic programming
Recent work in neural abstract machines has proposed many useful techniques to learn sequences of applications of discrete but differentiable operators. These techniques allow us to model traditionally procedural problems using neural networks. In this work, we are interested in using neural networks to learn to perform logic reasoning. We propose a model that has access to differentiable opera...
متن کاملA Truly Concurrent Semantics for a Simple Parallel Programming Language
This paper gives the first truly concurrent denotational, i.e., compositional semantics for a simple, deterministic parallel language. By truly concurrent we mean the denotational model does not rely on an interleaving of concurrent actions for its definition. Thus, our semantics does not reduce parallelism to nondeterminism, as is done in the more established approaches to concurrency. We also...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2020
ISSN: 2475-1421
DOI: 10.1145/3371106